A note on graphs with large girth and small minus domination number

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Graphs with Large Girth, Small Minus Domination Number

Dunbar et al. (1998) in Ref. [3] introduced the OI~/TLLS ck~r~in~rtio~ ~IWH/W ;,-(G) of a graph G and two open problems. In this paper, we show that for every negative integer k and positive integer m>,3. there exists a graph G with gn-th nl and ;‘(G) <k which is a positive answer for the open problem 2 in Ref. [3].

متن کامل

Domination number of cubic graphs with large girth

We show that every n-vertex cubic graph with girth at least g have domination number at most 0.299871n + O (n/g) < 3n/10 + O (n/g).

متن کامل

A note on signed and minus domination in graphs

In this paper, we give upper bounds on the upper signed domination number of [l, k] graphs, which generalize some results obtained in other papers. Further, good lower bounds are established for the minus ksubdomination number γ−101 ks and signed k-subdomination number γ −11 ks .

متن کامل

A note on independent domination in graphs of girth 5

Let G be a simple graph of order n, maximum degree ∆ and minimum degree δ ≥ 2. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. The girth g(G) is the minimum length of a cycle in G. We establish sharp upper and lower bounds, as functions of n, ∆ and δ, for the independent domination number of graphs G with g(G) ...

متن کامل

A note on independent domination in graphs of girth 6

Let G be a simple graph of order n, maximum degree Δ and minimum degree δ ≥ 2. The independent domination number i(G) is defined to be the minimum cardinality among all maximal independent sets of vertices of G. The girth g(G) is the minimum length of a cycle in G. We establish best possible upper and lower bounds, as functions of n, Δ and δ, for the independent domination number of graphs G wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1999

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(98)00082-1